Informatics Publishing Limited

S. Imavathy ¹, S. Mahalakshmi ¹, R. Uma Maheswari ², T. Vaishnavi ², P. Vennila ¹

Affiliations
1 Department of Information Technology, E.G.S. Pillay Engineering College, Nagai, IN
2 Department of Information Technology, E.G. Pillay Engineering College, Nagai, IN

Abstract

In a Computer Network, the peer-to-peer (P2P) paradigm has become very popular for loading and distributing information in separate manner that is from one single system to another system. At first, the P2P systems are very useful in sharing the one dimensional information. But nowadays, the need for P2P applications with multidimensional data has risen, inspiring research on P2P systems that can handle such type of data. Now the point to focus is on structured P2P systems that share spatial information (partial) and also we have to found the area and directionality of the multidimensional information. We present SPATIALP2P, which is a totally and inherently distributed P2P network and also a totally separate indexing and searching framework that is suitable for spatial data. SPATIALP2P supports P2P applications in which spatial information of various sizes can be dynamically edited, updated, and peers can leave or join. SPATIALP2P efficiently handles changes in the spatial information and in the network structure caused by joining or leaving peers without the need of load balancing or restructuring. Finally, contrary to existing DHT-based approaches, SPATIALP2P captures the locality and directionality of the 2D space.

Keywords

Peer-To-Peer, P2P Applications, Index Structure.

Full Text

     

R. Uma Maheswari ¹, D. Jeya Mala ²

Affiliations
1 Department of Computer Applications, K.L.N. College of Engineering, Sivagangai - 630612, Tamil Nadu, IN
2 Department of Computer Applications, Thiagarajar College of Engineering, Madurai - 625005, Tamil Nadu, IN

Abstract

Background: The test case prioritization of regression Testing is described. Methods: A new test case prioritization algorithm is proposed to get better the rate of fault detection and cost reduction. Heuristic Techniques like Genetic Algorithm (GA) and Simulated Annealing (SA) are employed. It prioritizes the test cases depends on fault detection ability and execution time taken. Findings: The implementation of proposed algorithm in JAVA is found to produce optimal or near optimal results. The efficiency of proposed regression testing technique is proved by comparing it with GA and SA methods individually. Applications: A complete automation tool for the complete usage of the algorithm is being developed. It will also be analyzed on larger projects with large number of test cases and faults.

Keywords

Fault Coverage, Genetic Algorithm, Heuristic Techniques, Regression Testing, Simulated Annealing, Test Case Prioritization

Full Text

   

R. Uma Maheswari ¹, S. Saravana Mahesan ², Tamilarasan ³, A. K. Subramani ⁴

Affiliations
1 Department of Computer Science Engineering, Vel Tech High Tech Dr. Rangarajan Dr. Sakunthala Engineering College, Avadi, Chennai-600062, Tamilnadu, IN
2 Department of Management Studies, Vel Tech Ranga Sanku Arts & Science College, Avadi, Chennai-600062, Tamilnadu, IN
3 Bharathiyar University, Coimbatore, IN
4 Vel Tech Institute of Management, Vel Tech Dr. RR & Dr. SR Technical University, Avadi, Chennai-600062, Tamilnadu, IN

Abstract

Data mining allows extracting valuable information from the historical data and predicting outcomes of future situations. CRM considers the customer as the centre point, which values the customers of the organization. This article explores the various data mining techniques and its impact on CRM to redefine business processes and strategies.

Keywords

CRM, DM, Mining Model, BIS, CHAID.

Full Text